Proving Information Inequalities and Identities with Symbolic Computation
نویسندگان
چکیده
Proving linear inequalities and identities of Shannon’s information measures, possibly with constraints on the is an important problem in theory. For this purpose, ITIP other variant algorithms have been developed implemented, which are all based solving a program (LP). In particular, identity f = 0 verified by two LPs, one for ≥ ≤ 0. paper, we develop set that can be implemented symbolic computation. Based these algorithms, procedures verifying devised. Compared LP-based our produce analytical proofs both human-verifiable free numerical errors. Our also more efficient computationally. constrained inequalities, taking advantage algebraic structure problem, size LP needs to solved significantly reduced. identities, instead directly very little
منابع مشابه
Combining Symbolic Computation and Theorem Proving: Some Problems of Ramanujan
One way of building more powerful theorem provers is to use techniques from symbolic computation. The challenge problems in this paper are taken from Chapter 2 of Ramanu-jan's Notebooks. They were selected because they are non-trivial and require the use of symbolic computation techniques. We have developed a theorem prover based on the symbolic computation system Mathematica that can prove all...
متن کاملSymbolic computation of the Duggal transform
Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...
متن کاملBasic Concepts, Identities and Inequalities - the Toolkit of Information Theory
Basic concepts and results of that part of Information Theory which is often referred to as “Shannon Theory” are discussed with focus mainly on the discrete case. The paper is expository with some new proofs and extensions of results and concepts.
متن کاملDiscovering and Proving Geometric Inequalities
’When computers were first conceived, the designed, and finally implemented, few people (if any) would have conjectured that in 1987 computer programs would exist capable of proving theorems from diverse areas of mathematics. Even further, if a person at the inception of the computer age had seriously predicted that computer programs would be used to occasionally answer open questions taken fro...
متن کاملDiscovering and Proving Infinite Binomial Sums Identities
We consider binomial and inverse binomial sums at infinity and rewrite them in terms of a small set of constants, such as powers of π or log(2). In order to perform these simplifications, we view the series as specializations of generating series. For these generating series, we derive integral representations in terms of root-valued iterated integrals. Using substitutions, we express the inter...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2023
ISSN: ['0018-9448', '1557-9654']
DOI: https://doi.org/10.1109/tit.2023.3263178